Fifty Three Matrix Factorizations: A Systematic Approach
نویسندگان
چکیده
The success of matrix factorizations such as the singular value decomposition (SVD) has motivated search for even more factorizations. We catalog 53 factorizations, most which we believe to be new. Our systematic approach, inspired by generalized Cartan Lie theory, also encompasses known SVD, symmetric eigendecomposition, CS decomposition, hyperbolic structured SVDs, Takagi factorization, and others thereby covering familiar well ones that were waiting discovered. suggest theory one way or another been lurking hidden in foundations very successful field computations with applications routinely used so many areas computation. In this paper, investigate consequences little these once properly identified can lead further work on algorithmic applications.
منابع مشابه
Riordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملLearning with matrix factorizations
Matrices that can be factored into a product of two simpler matrices can serve as a useful and often natural model in the analysis of tabulated or highdimensional data. Models based on matrix factorization (Factor Analysis, PCA) have been extensively used in statistical analysis and machine learning for over a century, with many new formulations and models suggested in recent years (Latent Sema...
متن کاملLocalization of Matrix Factorizations
Matrices with off-diagonal decay appear in a variety of fields in mathematics and in numerous applications, such as signal processing, statistics, communications engineering, condensed matter physics, and quantum chemistry. Numerical algorithms dealing with such matrices often take advantage (implicitly or explicitly) of the empirical observation that this off-diagonal decay property seems to b...
متن کاملConvex Sparse Matrix Factorizations
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by a convex rank-reducing term similar to the trace norm. In particular, our formulation introduces an explicit trade-off between size and sparsity of the decomposition of rectangular matrices. Using a large set of synth...
متن کاملA Tale of Two Matrix Factorizations
In statistical practice, rectangular tables of numeric data are commonplace, and are often analyzed using dimension reduction methods like the singular value decomposition (SVD) and its close cousin, principal component analysis (PCA). This analysis produces score and loading matrices representing the rows and the columns of the original table and these matrices may be used for both prediction ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2023
ISSN: ['1095-7162', '0895-4798']
DOI: https://doi.org/10.1137/21m1416035